Facial expression recognition of intercepted video sequences based on feature point movement trend and feature block texture variation

Facial Expression Recognition (FER) is an important subject of human–computer interaction and has long been a research area of great interest. Accurate Facial Expression Sequence Interception (FESI) and discriminative expression feature extraction are two enormous challenges for the video-based FER. This paper proposes a framework of FER for the intercepted video sequences by using feature point movement trend and feature block texture variation. Firstly, the feature points are marked by Active Appearance Model (AAM) and the most representative 24 of them are selected. Secondly, facial expression sequence is intercepted from the face video by determining two key frames whose emotional intensities are minimum and maximum, respectively. Thirdly, the trend curve which represents the Euclidean distance variations between any two selected feature points is fitted, and the slopes of specific points on the trend curve are calculated. Finally, combining Slope Set which is composed by the calculated slopes with the proposed Feature Block Texture Difference (FBTD) which refers to the texture variation of facial patch, the final expressional feature are formed and inputted to One-dimensional Convolution Neural Network (1DCNN) for FER. Five experiments are conducted in this research, and three average FER rates 95.2%, 96.5%, and 97% for Beihang University (BHU) facial expression database, MMI facial expression database, and the combination of two databases, respectively, have shown the significant advantages of the proposed method over the existing ones.     

基于改进飞蛾扑火优化算法的MIMO雷达相位编码信号集设计

提出一种MIMO雷达相位编码信号集设计方法，该方法对飞蛾扑火优化算法进行改进，利用改进的飞蛾扑火算法优化相位编码信号集，提高其正交性.在改进方法中，增加对火焰的更新过程，使火焰不仅能够保存最优飞蛾位置还具有搜索最优解的功能.优化过程以自相关函数旁瓣峰值和、互相关函数峰值和，以及自相关函数旁瓣能量、互相关函数能量作为算法适应度函数.仿真实验结果表明，改进方法明显提高了飞蛾扑火优化算法的收敛速度和收敛精度，且优化得到的信号集具有较低的自相关旁瓣值和互相关值.     

Type II fuzzy set-based data analytics to explore amino acid associations in protein sequences of Swine Influenza Virus

The veracity present in molecular data available in biological databases possesses new challenges for data analytics. The analysis of molecular data of various diseases can provide vital information for developing better understanding of the molecular mechanism of a disease. In this paper, an attempt has been made to propose a model that addresses the issue of veracity in data analytics for amino acid association patterns in protein sequences of Swine Influenza Virus. The veracity is caused by intra-sequential and inter-sequential biases present in the sequences due to varying degrees of relationships among amino acids. A complete dataset of 63,682 protein sequences is downloaded from NCBI and is refined. The refined dataset consists of 26,594 sequences which are employed in the present study. The type I fuzzy set is employed to explore amino acid association patterns in the dataset. The type I fuzzy support is refined to partially remove the inter-sequential biases causing veracity in data. The remaining inter-sequential biases present in refined fuzzy support are evaluated and eliminated using type II fuzzy set. Hence, it is concluded that a combination of type II fuzzy & refined fuzzy approach is the optimal approach for extracting a better picture of amino acid association patterns in the molecular dataset.     

Experience-Based Cognition for Driving Behavioral Fingerprint Extraction

Abstract

With the rapid progress of information technologies, cars have been made increasingly intelligent. This allows cars to act as cognitive agents, i.e., to acquire knowledge and understanding of the driving habits and behavioral characteristics of drivers (i.e., driving behavioral fingerprint) through experience. Such knowledge can be then reused to facilitate the interaction between a car and its driver, and to develop better and safer car controls. In this paper, we propose a novel approach to extract the driver’s driving behavioral fingerprints based on our conceptual framework Experience-Oriented Intelligent Things (EOIT). EOIT is a learning system that has the potential to enable Internet of Cognitive Things (IoCT) where knowledge can be extracted from experience, stored, evolved, shared, and reused aiming for cognition and thus intelligent functionality of things. By catching driving data, this approach helps cars to collect the driver’s pedal and steering operations and store them as experience; eventually, it uses obtained experience for the driver’s driving behavioral fingerprint extraction. The initial experimental implementation is presented in the paper to demonstrate our idea, and the test results show that it outperforms the Deep Learning approaches (i.e., deep fully connected neural networks and recurrent neural networks/Long Short-Term Memory networks).     

Clustering biomedical and gene expression datasets with kernel density and unique neighborhood set based vein detection

It is a crucial need for a clustering technique to produce high-quality clusters from biomedical and gene expression datasets without requiring any user inputs. Therefore, in this paper we present a clustering technique called KUVClust that produces high-quality clusters when applied on biomedical and gene expression datasets without requiring any user inputs. The KUVClust algorithm uses three concepts namely multivariate kernel density estimation, unique closest neighborhood set and vein-based clustering. Although these concepts are known in the literature, KUVClust combines the concepts in a novel manner to achieve high-quality clustering results. The performance of KUVClust is compared with established clustering techniques on real-world biomedical and gene expression datasets. The comparisons were evaluated in terms of three criteria (purity, entropy, and sum of squared error (SSE)). Experimental results demonstrated the superiority of the proposed technique over the existing techniques for clustering both the low dimensional biomedical and high dimensional gene expressions datasets used in the experiments.     

基于凸闭包集的不规则三角网算法研究与实现

不规则三角网是影响土石方量计算的关键问题之一，虽然目前已有大量研究人员对Delaunay三角网进行优化，但仍然缺少对三角网生成速率和计算精度的综合研究。针对此问题，基于VB.NET平台的点、边以及三角形的结构化数据结构设计快速生成凸闭包集形成Delaunay三角网，通过四边形空圆特性以及对角线最短原则对构网结果进行检验和优化。试验计算表明，该算法的计算结果与经典DTM法、方格网法的土方量计算相对误差均在0.30%以内。该方法不仅具有较高的组网效率，并能保持较好的计算精度。     

Sensor network design based on system-wide reliability criteria. Part I: Objectives

Reliability based criteria are quite popular for optimal sensor network design. We present a modified definition of system reliability for sensor network design for two applications: reliable estimation of variables in a steady state linear flow process, and reliable fault detection and diagnosis for any process. Unlike the weakest-link based definition of system reliability in the literature, the proposed definition considers the entire system and is consistent with the reliability concept used in classical reliability literature. For each application, dual approaches for defining system reliability are proposed, and their analogy with the reliability problem in the classical reliability literature is established. Using examples and stochastic simulations, the advantage of using the proposed system reliability in contrast to the existing definition is illustrated. Part II of this series of articles presents methods for efficient generation of the system reliability function and its use in optimization-based approaches for designing optimal sensor networks.     

基于三支决策的模糊信息系统OWA算子参数选择

在模糊信息系统中，通过有序加权平均（Ordered weighted averaging,OWA）算子计算对象相似度，可以建立λ截集的相容关系。当λ的值确定后，OWA算子中量词参数(α,β)的选取直接关系到不可区分关系的建立以及信息粒的粗细。因此合理选取参数(α,β)是值得进一步研究的问题。本文采用粗糙集三支决策理论，研究模糊信息系统 OWA算子参数选择的相关内容。基于参数的激进、中庸和消极语义，确定OWA算子(α,β)的3种常用取值；进而研究相似度、相容类、双向近似和三支区域在3种参数选择下的性质关系。最后利用实例验证分析了模糊量词参数语义解释的合理性。本文采用三支决策创新视角，得到模糊信息系统OWA算子的深入性质，为相关模糊量词参数提供语义解释与选择依据。     

An improved attribute reduction scheme with covering based rough sets

Attribute reduction is viewed as an important preprocessing step for pattern recognition and data mining. Most of researches are focused on attribute reduction by using rough sets. Recently, Tsang et al. discussed attribute reduction with covering rough sets in the paper (Tsang et al., 2008), where an approach based on discernibility matrix was presented to compute all attribute reducts. In this paper, we provide a new method for constructing simpler discernibility matrix with covering based rough sets, and improve some characterizations of attribute reduction provided by Tsang et al. It is proved that the improved discernibility matrix is equivalent to the old one, but the computational complexity of discernibility matrix is relatively reduced. Then we further study attribute reduction in decision tables based on a different strategy of identifying objects. Finally, the proposed reduction method is compared with some existing feature selection methods by numerical experiments and the experimental results show that the proposed reduction method is efficient and effective.